A Gröbner Approach to Involutive Bases
نویسنده
چکیده
Recently, Zharkov and Blinkov introduced the notion of involutive bases of polynomial ideals. This involutive approach has its origin in the theory of partial di erential equations and is a translation of results of Janet and Pommaret. In this paper we present a pure algebraic foundation of involutive bases of Pommaret type. In fact, they turn out to be generalized left Grobner bases of ideals in the commutative polynomial ring with respect to a non-commutative grading. The introduced theory will allow not only the veri cation of the results of Zharkov and Blinkov but it will also provide some new facts.
منابع مشابه
Experimental Analysis of Involutive Criteria
In this paper we present results of our computer experiments to study effectiveness of involutive criteria for avoiding useless prolongations in construction of polynomial Janet bases. These bases are typical representative of involutive bases. Though involutive bases are usually redundant as Gröbner ones, they can be used as well as the reduced Gröbner bases in whose theory Volker Weispfenning...
متن کاملComprehensive Involutive Systems
In this paper we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Gröbner system in theory of Gröbner bases. Given a parametric ideal, the space of parameters is decomposed into a finite set of cells. Each cell yields the corresponding involutive basis of the ideal f...
متن کاملInvolutive Algorithms for Computing Gröbner Bases
In this paper we describe an efficient involutive algorithm for constructing Gröbner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Gröbner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be...
متن کاملNoncommutative involutive bases
Gröbner Basis theory originated in the work of Buchberger [4] and is now considered to be one of the most important and useful areas of computer algebra. In 1993, Zharkov and Blinkov [13] proposed an alternative method of computing a commutative Gröbner Basis, namely the computation of an Involutive Basis. In the mid 1980’s, Mora showed [11] that Buchberger’s work could be generalised for nonco...
متن کاملOn Noncommutative Involutive Divisions
Buchberger’s algorithm for computing a Gröbner basis solves the ideal membership problem over commutative polynomial rings. In the early 1990’s, an alternative to this algorithm was found, namely the involutive basis algorithm, which provides a Gröbner basis with extra combinatorial properties. Buchberger’s work was generalised to noncommutative polynomial rings by Bergman and Mora during the 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 1995